"indegree" meaning in All languages combined

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "in",
        "3": "degree"
      },
      "expansion": "in + degree",
      "name": "compound"
    }
  ],
  "etymology_text": "From in + degree.",
  "forms": [
    {
      "form": "indegrees",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "indegree (plural indegrees)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Mandarin terms with redundant transliterations",
          "parents": [
            "Terms with redundant transliterations",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Graph theory",
          "orig": "en:Graph theory",
          "parents": [
            "Mathematics",
            "Visualization",
            "Formal sciences",
            "Computing",
            "Interdisciplinary fields",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "The number of edges directed into a vertex in a directed graph"
      ],
      "id": "en-indegree-en-noun-fjTNEXou",
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "edge",
          "edge"
        ],
        [
          "vertex",
          "vertex"
        ],
        [
          "directed graph",
          "directed graph"
        ]
      ],
      "raw_glosses": [
        "(graph theory) The number of edges directed into a vertex in a directed graph"
      ],
      "related": [
        {
          "word": "outdegree"
        }
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ],
      "translations": [
        {
          "code": "cmn",
          "lang": "Chinese Mandarin",
          "roman": "rùdù",
          "sense": "the number of edges directed into a vertex in a directed graph",
          "word": "入度"
        },
        {
          "code": "cmn",
          "lang": "Chinese Mandarin",
          "roman": "rùcìshù",
          "sense": "the number of edges directed into a vertex in a directed graph",
          "word": "入次数"
        },
        {
          "code": "fi",
          "lang": "Finnish",
          "sense": "the number of edges directed into a vertex in a directed graph",
          "word": "tuloaste"
        },
        {
          "code": "it",
          "lang": "Italian",
          "sense": "the number of edges directed into a vertex in a directed graph",
          "tags": [
            "masculine"
          ],
          "word": "grado entrante"
        },
        {
          "code": "ja",
          "lang": "Japanese",
          "roman": "nyūjisū",
          "sense": "the number of edges directed into a vertex in a directed graph",
          "word": "入次数"
        },
        {
          "code": "sv",
          "lang": "Swedish",
          "sense": "the number of edges directed into a vertex in a directed graph",
          "tags": [
            "common-gender"
          ],
          "word": "ingrad"
        }
      ]
    }
  ],
  "sounds": [
    {
      "ipa": "/ˈɪndəˌɡɹiː/"
    }
  ],
  "word": "indegree"
}

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "in",
        "3": "degree"
      },
      "expansion": "in + degree",
      "name": "compound"
    }
  ],
  "etymology_text": "From in + degree.",
  "forms": [
    {
      "form": "indegrees",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "indegree (plural indegrees)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "related": [
    {
      "word": "outdegree"
    }
  ],
  "senses": [
    {
      "categories": [
        "English 3-syllable words",
        "English compound terms",
        "English countable nouns",
        "English entries with incorrect language header",
        "English lemmas",
        "English nouns",
        "English terms with IPA pronunciation",
        "Mandarin terms with redundant transliterations",
        "en:Graph theory"
      ],
      "glosses": [
        "The number of edges directed into a vertex in a directed graph"
      ],
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "edge",
          "edge"
        ],
        [
          "vertex",
          "vertex"
        ],
        [
          "directed graph",
          "directed graph"
        ]
      ],
      "raw_glosses": [
        "(graph theory) The number of edges directed into a vertex in a directed graph"
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ]
    }
  ],
  "sounds": [
    {
      "ipa": "/ˈɪndəˌɡɹiː/"
    }
  ],
  "translations": [
    {
      "code": "cmn",
      "lang": "Chinese Mandarin",
      "roman": "rùdù",
      "sense": "the number of edges directed into a vertex in a directed graph",
      "word": "入度"
    },
    {
      "code": "cmn",
      "lang": "Chinese Mandarin",
      "roman": "rùcìshù",
      "sense": "the number of edges directed into a vertex in a directed graph",
      "word": "入次数"
    },
    {
      "code": "fi",
      "lang": "Finnish",
      "sense": "the number of edges directed into a vertex in a directed graph",
      "word": "tuloaste"
    },
    {
      "code": "it",
      "lang": "Italian",
      "sense": "the number of edges directed into a vertex in a directed graph",
      "tags": [
        "masculine"
      ],
      "word": "grado entrante"
    },
    {
      "code": "ja",
      "lang": "Japanese",
      "roman": "nyūjisū",
      "sense": "the number of edges directed into a vertex in a directed graph",
      "word": "入次数"
    },
    {
      "code": "sv",
      "lang": "Swedish",
      "sense": "the number of edges directed into a vertex in a directed graph",
      "tags": [
        "common-gender"
      ],
      "word": "ingrad"
    }
  ],
  "word": "indegree"
}